An alternative derivation of Katsevich's cone-beam reconstruction formula.

نویسنده

  • Guang-Hong Chen
چکیده

In this paper an alternative derivation of Katsevich's cone-beam image reconstruction algorithm is presented. The starting point is the classical Tuy's inversion formula. After (i) using the hidden symmetries of the intermediate functions, (ii) handling the redundant data by weighting them, (iii) changing the weighted average into an integral over the source trajectory parameter, and (iv) imposing an additional constraint on the weighting function, a filtered backprojection reconstruction formula from cone beam projections is derived. The following features are emphasized in the present paper: First, the nontangential condition in Tuy's original data sufficiency conditions has been relaxed. Second, a practical regularization scheme to handle the singularity is proposed. Third, the derivation in the cone beam case is in the same fashion as that in the fan-beam case. Our final cone-beam reconstruction formula is the same as the one discovered by Katsevich in his most recent paper. However, the data sufficiency conditions and the regularization scheme of singularities are different. A detailed comparison between these two methods is presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Filtered backprojection formula for exact image reconstruction from cone-beam data along a general scanning curve.

Recently, Katsevich proved a filtered backprojection formula for exact image reconstruction from cone-beam data along a helical scanning locus, which is an important breakthrough since 1991 when the spiral cone-beam scanning mode was proposed. In this paper, we prove a generalized Katsevich's formula for exact image reconstruction from cone-beam data collected along a rather flexible curve. We ...

متن کامل

Development of Computed Tomography Algorithms

Over the past several years, computed tomography (CT) methods have advanced significantly, yielding novel analytic and iterative solutions applicable to medical CT and micro-CT. The resulting algorithms promise to improve spatial , contrast, or temporal resolution as well as to suppress artifacts and reduce radiation dose. Significant attention has been devoted to optimizing computational perfo...

متن کامل

Exact helical reconstruction using native cone-beam geometries.

This paper is about helical cone-beam reconstruction using the exact filtered backprojection formula recently suggested by Katsevich (2002a Phys. Med. Biol. 47 2583-97). We investigate how to efficiently and accurately implement Katsevich's formula for direct reconstruction from helical cone-beam data measured in two native geometries. The first geometry is the curved detector geometry of third...

متن کامل

Parallel Implementation of Katsevich's FBP Algorithm

For spiral cone-beam CT, parallel computing is an effective approach to resolving the problem of heavy computation burden. It is well known that the major computation time is spent in the backprojection step for either filtered-backprojection (FBP) or backprojected-filtration (BPF) algorithms. By the cone-beam cover method [1], the backprojection procedure is driven by cone-beam projections, an...

متن کامل

Minimum detection windows, PI-line existence and uniqueness for helical cone-beam scanning of variable pitch.

The goal of this paper is to study Cone-beam CT scanning along a helix of variable pitch. First the rationale and applications in medical imaging of variable pitch CT reconstruction are explained. Then formulas for the minimum detection window are derived. The main part of the paper proves a necessary and sufficient condition for the existence and uniqueness of PI-lines inside this variable pit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Medical physics

دوره 30 12  شماره 

صفحات  -

تاریخ انتشار 2003